Polynomial Kernelization for Removing Induced Claws and Diamonds
نویسندگان
چکیده
منابع مشابه
Diminishable Parameterized Problems and Strict Polynomial Kernelization
Kernelization—a mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems—plays a central role in parameterized complexity and has triggered an extensive line of research. This is in part due to a lower bounds framework that allows to exclude polynomial-size kernels under the assumption of NP * coNP/poly. In this paper we consider a restricted yet natural...
متن کاملThe Lost Continent of Polynomial Time: Preprocessing and Kernelization
One of the main objectives of the talk is to survey the history of the practical algorithmic strategy of preprocessing (also called datareduction and kernelization) since the beginnings of computer science, and to overview what theoretical computer science has been able to say
متن کاملClaws for thought
What are the early signs of use? There are no early signs. There are only obvious signs common to all long-term users. What can be spotted is the transition from non-user to addict (one episode is sufficient for diagnosis). For example, an early draft of a manuscript may read “We replicated and extended a classic finding within an established theoretical framework...”; a later SciagraTM-influen...
متن کاملWeak compositions and their applications to polynomial lower bounds for kernelization
We introduce a new form of composition called weak composition that allows us to obtain polynomial kernelization lower-bounds for several natural parameterized problems. Let d ≥ 2 be some constant and let L1, L2 ⊆ {0, 1}∗ × N be two parameterized problems where the unparameterized version of L1 is NP-hard. Assuming coNP 6⊆ NP/poly, our framework essentially states that composing t L1-instances ...
متن کاملGenus Distributions for Iterated Claws
We derive a recursion for the genus distributions of the graphs obtained by iteratively attaching a claw to the dipole D3. The minimum genus of the graphs in this sequence grows arbitrarily large. The families of graphs whose genus distributions have been calculated previously are either planar or almost planar, or they can be obtained by iterative single-vertex or single-edge amalgamation of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2016
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-016-9689-x